/**
 * Given an array of integers, find out whether there are two distinct indices i and j in the array such that the difference between 
 * nums[i] and nums[j] is at most t and the difference between i and j is at most k.
 */
/**
 * @author I321035
 *
 */
package problem220_Contains_Duplicate_III;